On triangle path convexity in graphs
نویسندگان
چکیده
Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity. c © 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
Complexity aspects of the triangle path convexity
A path P = v1, . . . , vt is a triangle path (respectively, monophonic path) of G if no edges exist joining vertices vi and vj of P such that |j − i| > 2; (respectively, |j − i| > 1). A set of vertices S is convex in the triangle path convexity (respectively, monophonic convexity) of G if the vertices of every triangle path (respectively, monophonic path) joining two vertices of S are in S. The...
متن کاملConvex sets in graphs, II. Minimal path convexity
A set K of vertices in a connected graph is M-convex if and only if for every pair of vertices in K, all vertices of all chordless paths joining them also lie in K. Carathtodory, Helly and Radon type theorems are proved for M-convex sets. The Caratheodory number is 1 for complete graphs and 2 for other graphs, The Helly number equals the size of a maximum clique. The Radon number is one more th...
متن کاملMaximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph T (G) has the triangles of the graph G as its vertices, two of these being adjacent whenever as triangles in G they share an edge. A graph is edge-triangular if every edge is in at least one triangle. ...
متن کاملOn local convexity in graphs
A set K of nodes of a graph G is geodesically convex (respectively, monophonically convex) if K contains every node on every shortest (respectively, chordless) path joining nodes in K. We investigate the classes of graphs which are characterized by certain local convexity conditions with respect to geodesic convexity, in particular, those graphs in which balls around nodes are convex, and those...
متن کاملLong heterochromatic paths in heterochromatic triangle free graphs ∗
In this paper, graphs under consideration are always edge-colored. We consider long heterochromatic paths in heterochromatic triangle free graphs. Two kinds of such graphs are considered, one is complete graphs with Gallai colorings, i.e., heterochromatic triangle free complete graphs; the other is heterochromatic triangle free graphs with k-good colorings, i.e., minimum color degree at least k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 206 شماره
صفحات -
تاریخ انتشار 1999